An Explicit Formula for Local Densities of Quadratic Forms
نویسندگان
چکیده
Let S and T be two positive definite integral matrices of rank m and n respectively. It is an ancient but still very challenging problem to determine how many times S can represent T , i.e., the number of integral matrices X with XSX = T . However, Siegel proved in his celebrated paper ([Si1]) that certain weighted averages of these numbers over the genus of S can be expressed as the Euler product of pure local data—confluent hypergeometric functions for p = ∞ and local densities αp(T, S) for p < ∞ (see (1.1) for definition). Siegel himself extended this result to indefinite forms ([Si2-3]) in early fifties. A. Weil reinterpreted Siegel’s results in terms of representation and extended his results to other classical groups in 1965 ([We]). Roughly speaking, the Siegel-Weil formula says that the theta integral associated to a vector space (quadratic or Hermitian) is the special value of some Eisenstein series at certain point when both the theta integral and Eisenstein series (at the point) are both absolutely convergent. Recently, Kudla and Rallis pushed the results to non-convergent regions ([KR1-3]). From the point view of representation theory, the local density can be viewed as the special value of a local Whittaker function, which is the local factor of the Fourier coefficients of the Eisenstein series. For a lot of arithmetic applications, it is very important to have an exact formula for the local densities. For example, in his work on central derivative of Eisenstein series ([Ku1]), Kudla needed to compare the local density of certain ternary form with intersection number on some formal group. The explicit formula for local density was also used in Gross and Keating’s work in the intersection section of modular correspondence ([GK]). However, explicit formulas of local densities are known hard to obtain and are complicated in general. Siegel himself obtained an explicit formula for n = 1 or m = n assuming S is unimodular and p 6= 2. Under the
منابع مشابه
Local Densities of 2-adic Quadratic Forms
In this paper, we give an explicit from formula for the local density number of representing a two by two 2-integral matrix T by a quadratic 2-integral lattice L over Z2. The non-dyadic case was dealt in a previous paper. The special case when L is a (maximal) lattice in the space of trace zero elements in a quaternion algebra over Q2 yields a clean and interesting formula, which matches up per...
متن کاملOn the square root of quadratic matrices
Here we present a new approach to calculating the square root of a quadratic matrix. Actually, the purpose of this article is to show how the Cayley-Hamilton theorem may be used to determine an explicit formula for all the square roots of $2times 2$ matrices.
متن کاملAn inexact alternating direction method with SQP regularization for the structured variational inequalities
In this paper, we propose an inexact alternating direction method with square quadratic proximal (SQP) regularization for the structured variational inequalities. The predictor is obtained via solving SQP system approximately under significantly relaxed accuracy criterion and the new iterate is computed directly by an explicit formula derived from the original SQP method. Under appropriat...
متن کاملAn explicit formula for the number of fuzzy subgroups of a finite abelian $p$-group\ of rank two
Ngcibi, Murali and Makamba [Fuzzy subgroups of rank two abelian$p$-group, Iranian J. of Fuzzy Systems {bf 7} (2010), 149-153]considered the number of fuzzy subgroups of a finite abelian$p$-group $mathbb{Z}_{p^m}times mathbb{Z}_{p^n}$ of rank two, andgave explicit formulas for the cases when $m$ is any positiveinteger and $n=1,2,3$. Even though their method can be used for thecases when $n=4,5,l...
متن کاملExplicit equivalence of quadratic forms over $\mathbb{F}_q(t)$
We propose a randomized polynomial time algorithm for computing nontrivial zeros of quadratic forms in 4 or more variables over Fq(t), where Fq is a finite field of odd characteristic. The algorithm is based on a suitable splitting of the form into two forms and finding a common value they both represent. We make use of an effective formula on the number of fixed degree irreducible polynomials ...
متن کامل